Cartesian product

英 [kɑːˈtiːziən ˈprɒdʌkt]

美 [kɑːrˈtiːziən ˈprɑːdʌkt]

网络  笛卡兒積; 笛卡尔积; 笛卡儿积; 笛卡儿乘积; 笛卡尔乘积

计算机

双语例句

• In this paper, A theorem for the binding number of multiple cartesian product of path and circuits is proven, and some limit properties of the binding number of multiple product graphs are presented.
  本文证明了路与回路的多重笛卡尔乘积的联结数的一个定理，并给出了若干多重乘积图的联结数的极限性质。
• It is proved that: ( 1) The cartesian product, the lexicographic product and the strong direct product in the products of connected graphs, are the path-positive graphs.
  证明了：（1）如果G1和G2都是连通图，则积图中笛卡尔积，逻辑积和强直积都是道路正图。
• Adjacent vertex-distinguishing VE-total coloring of Cartesian product graph of some graphs
  部分图笛卡儿积图的邻点可区别VE-全染色
• Pure situations in different blocks of the Cartesian product have different game results, generally.
  纯策略空间的笛卡尔乘积的不同分块中的纯局势一般具有不同的博弈结果。
• The main results of the paper are as follows: we not only prove that the Cartesian product of graphs of path and path, path and cycle satisfies the conjecture, but also give their coloring number.
  本文的主要结果如下：我们不仅证明了路与路、路与圈的笛卡尔积图满足关联色数猜想，进而确定了它们的关联色数。
• The Geodetic Number of Cartesian Product on Cycles and Complete Graphs
  关于圈与完全图的笛卡儿积的测地数
• The Adjacent-vertex Distinguishing Total-coloring Problem of Cartesian Product and Double Graph of Some Special Classes Graphs
  一些特殊图类的笛卡尔积和倍图的邻点可区别的全染色问题
• On the Super 3-restricted Edge Connectivity of Cartesian Product of Graphs
  笛卡尔乘积图的超级3-限制边连通性
• One convex set which is Cartesian product of nonregular convex polygons is used instead of the other convex set which is Cartesian product of regular polygons.
  采用不规则凸多边形的笛卡儿积构成的凸集代替正多边形的笛卡儿积构成的凸集，前者比后者更紧凑。
• The1= 1 one logic is in the expression to ensure the join will always be true and allows for the Cartesian Product result set.
  表达式中的1=1逻辑确保连接一直为true并允许笛卡尔Product结果集。